Fault Tolerance of Cayley Graphs
نویسندگان
چکیده
It is a difficult problem in general to decide whether a Cayley graph Cay(G; S) is connected where G is an arbitrary finite group and S a subset of G. For example, testing primitivity of an element in a finite field is a special case of this problem but notoriously hard. In this paper, it is shown that if a Cayley graph Cay(G; S) is known to be connected then its fault tolerance can be determined in polynomial time in |S| log(|G|). This is accomplished by establishing a new structural result for Cayley graphs. This result also yields a simple proof of optimal fault tolerance for an infinite class of Cayley graphs, namely exchange graphs. We also use the proof technique for our structural result to give a new proof of a known result on quasiminimal graphs.
منابع مشابه
Cayley graphs and symmetric interconnection networks
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate ...
متن کاملComputer Science Technical Report A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant de...
متن کاملNotes on The Connectivity of Cayley Coset Digraphs
Hamidoune’s connectivity results [11] for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayley coset digraph can be hierarchically decomposed in a certain way, then it is optimally vertex connected. The results are obtained by extending the methods used in [11]. They are used to show that cycle-prefix g...
متن کاملAnalysis of Fault Tolerance in Cayley Digraphs Using Forbidden Faulty Sets Parallel and Distributed Computing Laboratory Analysis of Fault Tolerance in Cayley Digraphs Using Forbidden Faulty Sets
PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL Abstract The connectivity and fault tolerance measures of various interconnection networks assume that all the neighboring nodes of any node could be faulty at the same time. The forbidden faulty set analysis of restricted connectivity and fault tolerance assumes that a set of nodes cannot be fau...
متن کاملConnectivity of Cayley Graphs: A Special Family
Taking any finite group G, let H ⊂ G be such that 1 6∈ H (where 1 represents the identity element of G) and h ∈ H implies h−1 ∈ H. The Cayley graph X(G;H) is the graph whose vertices are labelled with the elements of G, in which there is an edge between two vertices g and gh if and only if h ∈ H. The exclusion of 1 from H eliminates the possibility of loops in the graph. The inclusion of the in...
متن کامل